Drawing outer-1-planar graphs revisited
نویسندگان
چکیده
منابع مشابه
Drawing Outer 1-planar Graphs with Few Slopes
A graph is outer 1-planar if it admits a drawing where each vertex is on the outer face and each edge is crossed by at most another edge. Outer 1-planar graphs are a superclass of the outerplanar graphs and a subclass of the planar partial 3-trees. We show that an outer 1-planar graph G of bounded degree ∆ admits an outer 1-planar straight-line drawing that uses O(∆) different slopes, which gen...
متن کاملPlanar Drawing of Clustered Graphs
Graphs are often used to represent relational information. As the amount of information that we want to visualize becomes larger and more complicated, classical graph model tends to be insuucient. In this paper, we introduce and show how to draw a practical and simple graph structure known as clustered graphs. We present an algorithm which produces planar, straight-line, convex drawings of clus...
متن کاملOn Drawing Planar Angle Graphs
Recently, some advanced algorithms for straight line drawings of planar graphs have been introduced. However, these algorithms produce drawings with many small angles. Their drawings are not aesthetically nice. Our goal is to resolve these problems by a beautifier. We consider the angles of planar straight line drawings. In a first phase we compute maximal angles by repeatedly solving a linear ...
متن کاملDrawing HV-Restricted Planar Graphs
A strict orthogonal drawing of a graph G = (V,E) in R is a drawing of G such that each vertex is mapped to a distinct point and each edge is mapped to a horizontal or vertical line segment. A graph G is HV -restricted if each of its edges is assigned a horizontal or vertical orientation. A strict orthogonal drawing of an HV -restricted graph G is good if it is planar and respects the edge orien...
متن کاملDrawing Planar Graphs with Reduced Height
A straight-line (respectively, polyline) drawing Γ of a planar graph G on a set Lk of k parallel lines is a planar drawing that maps each vertex of G to a distinct point on Lk and each edge of G to a straight line segment (respectively, a polygonal chain with the bends on Lk) between its endpoints. The height of Γ is k, i.e., the number of lines used in the drawing. In this paper we compute new...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2022
ISSN: ['1526-1719']
DOI: https://doi.org/10.7155/jgaa.00581